Combining Instance Information to Classify Bags
نویسندگان
چکیده
Multiple Instance Learning is concerned with learning from sets (bags) of feature vectors (instances), where the bags are labeled, but the instances are not. One of the ways to classify bags is using a (dis)similarity space, where each bag is represented by its dissimilarities to certain prototypes, such as bags or instances from the training set. The instance-based representation preserves the most information, but is very high-dimensional, whereas the bag-based representation has lower dimensionality, but risks throwing away important information. We show a connection between these representations and propose an alternative representation based on combining classifiers, which can potentially combine the advantages of the other methods. The performances of the ensemble classifiers are disappointing, but require further investigation. The bag-based representation preserves sufficient information to classify bags correctly and produces the best results on several datasets.
منابع مشابه
Multiple-Instance Learning for Music Information Retrieval
•Multiple-instance learning (MIL) algorithms train classifiers from lightly supervised data – collections of instances, called bags, are labeled rather than the instances themselves – algorithms can classify bags or instances, we focus on instances •Motivation for applying MIL to MIR: – propagate metadata between granularities: artist, album, track, 10-second clip – e.g. train clip classifiers ...
متن کاملReview of Multi-Instance Learning and Its applications
Multiple Instance Learning (MIL) is proposed as a variation of supervised learning for problems with incomplete knowledge about labels of training examples. In supervised learning, every training instance is assigned with a discrete or real-valued label. In comparison, in MIL the labels are only assigned to bags of instances. In the binary case, a bag is labeled positive if at least one instanc...
متن کاملA Conditional Random Field for Multiple-Instance Learning
We present MI-CRF, a conditional random field (CRF) model for multiple instance learning (MIL). MI-CRF models bags as nodes in a CRF with instances as their states. It combines discriminative unary instance classifiers and pairwise dissimilarity measures. We show that both forces improve the classification performance. Unlike other approaches, MI-CRF considers all bags jointly during training a...
متن کاملClass-Dependent Dissimilarity Measures for Multiple Instance Learning
Multiple Instance Learning (MIL) is concerned with learning from sets (bags) of feature vectors (instances), where the individual instance labels are ambiguous. In MIL it is often assumed that positive bags contain at least one instance from a so-called concept in instance space, whereas negative bags only contain negative instances. The classes in a MIL problem are therefore not treated in the...
متن کاملGreedy Multiple Instance Learning via Codebook Learning and Nearest Neighbor Voting
Multiple instance learning (MIL) has attracted great attention recently in machine learning community. However, most MIL algorithms are very slow and cannot be applied to large datasets. In this paper, we propose a greedy strategy to speed up the multiple instance learning process. Our contribution is two fold. First, we propose a density ratio model, and show that maximizing a density ratio fu...
متن کامل